Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
نویسندگان
چکیده
منابع مشابه
Conditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices
Recently, Laplacian matrices of graphs are studied as density matrices in quantum mechanics. We continue this study and give conditions for separability of generalized Laplacian matrices of weighted graphs with unit trace. In particular, we show that the Peres-Horodecki positive partial transpose separability condition is necessary and sufficient for separability in C2 ⊗ C. In addition, we pres...
متن کاملSome new sufficient conditions for generalized strictly diagonally dominant matrices
Generalized strictly diagonally dominant matrices have wide applications in science and engineering, but it is very difficult to determine whether a given matrix is a generalized strictly diagonally dominant matrix or not in practice. In this paper, we give several practical conditions for generalized strictly diagonally dominant matrices by constructing different positive diagonal matrix and a...
متن کاملDoubly Diagonally Dominant Matrices
We consider the class of doubly diagonally dominant matrices (A = [ ajj] E C”, ‘, la,,1 l”jjl > Ck+ i laiklCk+ jlajkl. i #j) and its subclasses. We give necessary and sufficient conditions in terms of the directed graph for an irreducibly doubly diagonally dominant matrix to be a singular matrix or to be an H-matrix. As in the case of diagonal dominance, we show that the Schur complements of do...
متن کاملRelative Perturbation Theory for Diagonally Dominant Matrices
OF DISSERTATION RELATIVE PERTURBATION THEORY FOR DIAGONALLY DOMINANT MATRICES Diagonally dominant matrices arise in many applications. In this work, we exploit the structure of diagonally dominant matrices to provide sharp entrywise relative perturbation bounds. We first generalize the results of Dopico and Koev to provide relative perturbation bounds for the LDU factorization with a well condi...
متن کاملSelf-Corrective Algorithms for Generalized Diagonally Dominant Matrices
A suggestive indicator is proposed for predicting whether a given (complex or real) square matrix A is or isn’t a generalized diagonally dominant matrix (GDDM) by which we mean if A can be brought into a strictly diagonally dominant matrix by post-multiplying some diagonal matrix D. Based on the indicator, three self-corrective algorithms are presented for determining if A is or is not a GDDM a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 2006
ISSN: 0375-9601
DOI: 10.1016/j.physleta.2005.10.049